A non-zero integer non-linear programming model for maintenance workforce sizing

نویسندگان

  • D. E. Ighravwe
  • S. A. Oke
چکیده

This paper formulates a non-linear integer programming model to solve a maintenance workforce sizing problem with a productivity improvement goal. This problem is modelled in a bi-objective framework that minimises the number of maintenance personnel while maximising their productivity levels. Inputs into the optimisation model include monthly and routine maintenance periods, volume of production, contingency maintenance time, use factor and priority factor among others. The model has been validated with real-life detergent factory data, demonstrating its potential usefulness. A principal novelty of the model is the inclusion of use factor, which captures how often maintenance technicians are busy on the job with respect to assigned tasks, including unanticipated high maintenance workload. The model has been solved using a branch and bound algorithm. The impact of workforce structure and workers’ salaries on model’s performance has been studied and sensitivity analysis carried out to investigate the changes to the optimal solution as a result of changes in the input data. The results show a reduction in the number of maintenance workforce personnel in comparing values with and without use factor in the model. The model’s ability to obtain global optimal result depends on the value of the minimum routine maintenance time within each maintenance section. Also, the model is shown to be sensitive to priority factor, which captures the appropriate ratio of fulland part-time workers under the same category. The model provides both an easy-to-use practical tool for maintenance managers and supervisors as well as a scientific tool for determining optimal maintenance workforce size for a manufacturing plant. & 2014 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

متن کامل

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

متن کامل

Flux Distribution in Bacillus subtilis: Inspection on Plurality of Optimal Solutions

Linear programming problems with alternate solutions are challenging due to the choice of multiple strategiesresulting in the same optimal value of the objective function. However, searching for these solutions is atedious task, especially when using mixed integer linear programming (MILP), as previously applied tometabolic models. Therefore, judgment on plurality of optimal m...

متن کامل

A two-stage stochastic programming model for the optimal sizing of hybrid PV/diesel/battery in hybrid electric ship system

Ships play the major role in bulk transportation and they need their special energy system. This paper proposes a stochastic programing method for optimal sizing of a hybrid ship power system with energy storage system (ESS), photovoltaic power (PV) and diesel generator. To account for uncertainties, in this study a two-stage stochastic mixed-integer non-linear programing is used to model the o...

متن کامل

Well-dispersed subsets of non-dominated solutions for MOMILP ‎problem

This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015